A geometrical method in combinatorial complexity
نویسندگان
چکیده
منابع مشابه
Assuaging nutritional complexity: a geometrical approach.
We have introduced a framework that enables the identification of the important elements in complex nutritional systems, and the quantification of the interactions among them. These interactions include those among the multiple constituents of the ingesta, as well as between behavioural (ingestive) and physiological (post-ingestive) components of nutritional homeostasis. The resulting descripti...
متن کاملGeometrical Complexity of Classification Problems
Despite encouraging recent progresses in ensemble approaches, classification methods seem to have reached a plateau in development. Further advances depend on a better understanding of geometrical and topological characteristics of point sets in high-dimensional spaces, the preservation of such characteristics under feature transformations and sampling processes, and their interaction with geom...
متن کاملGeometrical Complexity of Data Approximators
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types of principal curves and principal trees, and so on. For each type of approximators the measure of the approximator complexity was developed too. These measure...
متن کاملSurvey on assembly sequencing: a combinatorial and geometrical perspective
A systematic overview on the subject of assembly sequencing is presented. Sequencing lies at the core of assembly planning, and variants include finding a feasible sequence –respecting the precedence constraints between the assembly operations–, or determining an optimal one according to one or several operational criteria. The different ways of representing the space of feasible assembly seque...
متن کاملConundrum of Combinatorial Complexity
This paper examines fundamental problems underlying difficulties encountered by pattern recognition algorithms, neural networks, and rule systems. These problems are manifested as combinatorial complexity of algorithms, of their computational or training requirements. The paper relates particular types of complexity problems to the roles of a priori knowledge and adaptive learning. Paradigms ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1981
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1981.103900